A simplification procedure for alternational normal schemata.
نویسندگان
چکیده
منابع مشابه
A DPLL Proof Procedure for Propositional Iterated Schemata
We investigate iterated schemata whose syntax integrates arithmetic parameters, indexed propositional variables (e.g. Pi), and iterated conjunctions/disjunctions (e.g. Vn i=1 Pi, where n is a parameter). Using this formalism gives us some extra information about the structure of the problem, which can be used in order to prove such a schema for all values of the parameters. The structure of the...
متن کاملA BDD-Based Simplification and Skolemization Procedure
We introduce a new technique to simplify and skolemize rst-order formulas, based on binary decision diagrams, or BDDs. This technique is more computation-intensive than previously known ones, but in general provides better skolemized forms that attempt to reduce the number of false dependencies. This technique can also be seen as a practical way of simplifying rst-order formulas before feeding ...
متن کاملA compiler for parsing schemata
We present a compiler which can be used to automatically obtain efficient Java implementations of parsing algorithms from formal specifications expressed as parsing schemata. The system performs an analysis of the inference rules in the input schemata in order to determine the best data structures and indexes to use, and ensure that the generated implementations are efficient. The system descri...
متن کاملA schemata theorem for trees
The proof of a schemata theorem for trees of bounded branching with a probabilistic crossover is sketched. The argument presented applies only to the case where the genetic information is placed at the terminal nodes of the tree although the shape of the tree itself can be considered as an additional form of genetic information.
متن کاملSuperposition with Simplification as a Desision Procedure for the Monadic Class with Equality
We show that strict superposition, a restricted form of paramodulation, can be combined with specifically designed simplification rules such that it becomes a decision procedure for the monadic class with equality. The completeness of the method follows from a general notion of redundancy for clauses and superposition inferences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1979
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093882798